Capacity-constrained Wardrop equilibria and application to multi-connectivity in 5G networks
نویسندگان
چکیده
In this paper, a distributed, non-cooperative and dynamic load-balancing algorithm is proposed in the context of multi-commodity adversarial network equilibria with constrained providers’ capacities. The proven to converge generalised Wardrop user-equilibrium, referred as Beckmann equilibrium literature, which, for each commodity, latencies unsaturated providers are equalized. then used Multi-connectivity 5G heterogeneous networks, which user equipments able use different access networks simultaneously increase transmission capacity and/or improve reliability. controller provides solution traffic steering by distributing load over available points, considered providers. Simulation results validate approach. developed simulator an open-source environment De Santis et al. (2020).
منابع مشابه
Wardrop Equilibria
A common behavioral assumption in the study of transportation and telecommunication networks is that travelers or packets, respectively, choose routes that they perceive as being the shortest under the prevailing traffic conditions [1]. The situation resulting from these individual decisions is one in which drivers cannot reduce their journey times by unilaterally choosing another route, which ...
متن کاملCooperative dynamics and Wardrop equilibria
A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be viewed as approximate, generalized Wardrop equilibria.
متن کاملAspects of Wardrop equilibria
Global communication networks like the Internet often lack a central authority that monitors and regulates network traffic. Mostly even cooperation among network users is not possible. Network users may behave selfishly according to their private interest without regard to the overall system performance. Such highly complex environments prompted a paradigm shift in computer science. Whereas tra...
متن کاملFrom discrete to continuous Wardrop equilibria
The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model ...
متن کاملDistributed Learning of Wardrop Equilibria
We consider the problem of learning equilibria in a well known game theoretic traffic model due to Wardrop. We consider a distributed learning algorithm that we prove to converge to equilibria. The proof of convergence is based on a differential equation governing the global macroscopic evolution of the system, inferred from the local microscopic evolutions of agents. We prove that the differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of The Franklin Institute-engineering and Applied Mathematics
سال: 2021
ISSN: ['1879-2693', '0016-0032']
DOI: https://doi.org/10.1016/j.jfranklin.2021.09.025